multidimensional transportation problem - definição. O que é multidimensional transportation problem. Significado, conceito
DICLIB.COM
Ferramentas linguísticas em IA
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:     

Tradução e análise de palavras por inteligência artificial

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

O que (quem) é multidimensional transportation problem - definição

THE MATHEMATICAL STUDY OF OPTIMAL TRANSPORTATION AND ALLOCATION OF RESOURCES
Transport problem; Optimal transport problem; Transportation problem; Monge-Kantorovich transportation problem; Optimal transport; Monge-Kantorovich problem; Monge–Kantorovich problem

Multidimensional assignment problem         
GENERALIZATION OF LINEAR ASSIGNMENT PROBLEM FROM TWO TO MULTIPLE DIMENSIONS
Draft:Multidimensional assignment problem (MAP); Multidimensional assignment problem (MAP)
The multidimensional assignment problem (MAP) is a fundamental combinatorial optimization problem which was introduced by William Pierskalla. This problem can be seen as a generalization of the linear assignment problem.
Multidimensional scaling         
SET OF RELATED ORDINATION TECHNIQUES USED IN INFORMATION VISUALIZATION
Multidimensional scaling in marketing; Multi dimensional scaling (in marketing); Multi dimensional scaling; Multidimensional scaling (in marketing); Classical multidimensional scaling; Multidimensional Scaling; Principal coordinates analysis; Principal coordinate analysis; Principal co-ordinates analysis; Principal co-ordinate analysis; Smallest space analysis; Smallest Space Analysis; Multi-Dimensional Scaling; Principle coordinates analysis; Principle coordinate analysis; User:Jigang.sun/Enter your new article name here; Smallest-space analysis; Multi-dimensional scaling; CMDS; MDS plot; Non-metric multidimensional scaling; Metric multidimensional scaling
Multidimensional scaling (MDS) is a means of visualizing the level of similarity of individual cases of a dataset. MDS is used to translate "information about the pairwise 'distances' among a set of n objects or individuals" into a configuration of n points mapped into an abstract Cartesian space.
CMDS         
SET OF RELATED ORDINATION TECHNIQUES USED IN INFORMATION VISUALIZATION
Multidimensional scaling in marketing; Multi dimensional scaling (in marketing); Multi dimensional scaling; Multidimensional scaling (in marketing); Classical multidimensional scaling; Multidimensional Scaling; Principal coordinates analysis; Principal coordinate analysis; Principal co-ordinates analysis; Principal co-ordinate analysis; Smallest space analysis; Smallest Space Analysis; Multi-Dimensional Scaling; Principle coordinates analysis; Principle coordinate analysis; User:Jigang.sun/Enter your new article name here; Smallest-space analysis; Multi-dimensional scaling; CMDS; MDS plot; Non-metric multidimensional scaling; Metric multidimensional scaling
Cambridge Model Distributed System (Reference: OS)

Wikipédia

Transportation theory (mathematics)

In mathematics and economics, transportation theory or transport theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781.

In the 1920s A.N. Tolstoi was one of the first to study the transportation problem mathematically. In 1930, in the collection Transportation Planning Volume I for the National Commissariat of Transportation of the Soviet Union, he published a paper "Methods of Finding the Minimal Kilometrage in Cargo-transportation in space".

Major advances were made in the field during World War II by the Soviet mathematician and economist Leonid Kantorovich. Consequently, the problem as it is stated is sometimes known as the Monge–Kantorovich transportation problem. The linear programming formulation of the transportation problem is also known as the Hitchcock–Koopmans transportation problem.